Formalizing Automata II Decidable Properties
نویسنده
چکیده
Is it possible to create formal proofs of interesting mathematical theorems which are me chanically checked in every detail and yet are readable and even faithful to the best expositions of those results in the literature This paper answers that question positively for theorems about decidable properties of nite automata The exposition is from Hopcroft and Ullman s classic textbook Formal Languages and Their Relation to Automata This paper describes a successful formalization which is faithful to that book The requirement of being faithful to the book has unexpected consequences namely that the underlying formal theory must include primitive notions of computability This requirement makes a constructive formalization especially suitable It also opens the possibility of using the formal proofs to decide properties of automata The paper shows how to do this
منابع مشابه
Decidable Properties for Regular Cellular Automata
We investigate decidable properties for regular cellular automata. In particular, we show that regularity itself is an undecidable property and that nilpotency, equicontinuity and positively expansiveness became decidable if we restrict to regular cellular automata.
متن کاملWeighted O-Minimal Hybrid Systems Are More Decidable Than Weighted Timed Automata!
We consider weighted o-minimal hybrid systems, which extend classical o-minimal hybrid systems with cost functions. These cost functions are “observer variables” which increase while the system evolves but do not constrain the behaviour of the system. In this paper, we prove two main results: (i) optimal o-minimal hybrid games are decidable; (ii) the model-checking of WCTL, an extension of CTL ...
متن کاملOn Presburger Liveness of Discrete Timed Automata
Using an automata-theoretic approach, we investigate the decidability of liveness properties (called Presburger liveness properties) for timed automata when Presburger formulas on configurations are allowed. While the general problem of checking a temporal logic such as TPTL augmented with Presburger clock constraints is undecidable, we show that there are various classes of Presburger liveness...
متن کاملDecidable Veriication for Reducible Timed Automata Speciied in a First Order Logic with Time. Decidable Veriication for Reducible Timed Automata Speciied in a First Order Logic with Time
We consider the veriication problem for timed programs which requirements speciication is given in a rst order logic with explicit time (that is in a rather general setting), and program speciication is represented by a timed automaton. We formalize an observation concerning some practical systems of control which is related to their ""niteness". Algorithm of control often memorizes and uses on...
متن کاملOn Decidability Properties of One-Dimensional Cellular Automata
In a recent paper Sutner proved that the first-order theory of the phase-space SA = (Q ,−→) of a one-dimensional cellular automaton A whose configurations are elements of Q, for a finite set of states Q, and where −→ is the “next configuration relation”, is decidable [Sut09]. He asked whether this result could be extended to a more expressive logic. We prove in this paper that this is actuallly...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003